package bTree.LeetCode;

public class 重复的子字符串 {
    public boolean repeatedSubstringPattern(String s) {
        int length = s.length();
        String ss=(s+s).substring(1,2*length-1);
        if(ss.contains(s)){
            return true;
        }
        return false;
    }
}